Typechecking XML views of relational databases
نویسندگان
چکیده
منابع مشابه
Complexity of Typechecking XML Views of Relational Databases
The typechecking problem for transformations of relational data into tree data is the following: given a TreeQL program P (called transformation), and a DTD d (called output type), decide whether for every database instance D the result of the transformation P of D is of a type consistent with d (see [2]). TreeQL programs with projectionfree conjunctive queries and DTDs with arbitrary regular e...
متن کاملUpdating Relational Databases through XML Views
This paper presents an overview of a process for updating relational databases through XML views. The process is based on a query language called R2X and on a concept of normalization for XML views. The R2X language constructs XML views from relational databases, while normalization removes the ambiguity in an XML view, thus solving the update problem. In order to normalize an XML view, we bene...
متن کاملBuilding updateable XML views on top of relational databases
In this paper we address the problem of adding XML interface to existing relational database solutions by providing mechanisms for storing, retrieving and querying information which resides in relational database by XML means. These mechanisms should be transparent enough to allow a database to act as a simple set of XML documents with the advantage of much more efficient querying. We describe ...
متن کاملReasoning About the Updatability of XML Views Over Relational Databases
XML has become an important medium for data exchange, and is also used as an interface to – i.e. a view of – a relational database. While previous work has considered XML views for the purpose of querying relational databases (e.g. Silkroute), in this paper we consider the problem of updating a relational database through an XML view. Using the nested relational algebra as the formalism for an ...
متن کاملOn the updatability of XML views over relational databases
XML has become an important medium for data exchange, and is also used as an interface to – i.e. a view of – a relational database. While previous work has considered XML views for the purpose of querying relational databases (e.g. Silkroute), in this paper we consider the problem of updating a relational database through an XML view. Using the nested relational algebra as the formalism for an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2003
ISSN: 1529-3785,1557-945X
DOI: 10.1145/772062.772065